A Game-Theoretic Analysis of Baccara Chemin de Fer, II

In a previous paper, we considered several models of the parlor game baccara chemin de fer, including Model B2 (a 2×2484 matrix game) and B3 25×2484 game), both which depend on positive-integer parameter d, number decks. The key to solving under was what called Foster’s algorithm, applies additive 2×2n games. Here “additive” means that payoffs are in n binary choices comprise player II pure strategy. present consider analogous casino fer take into account 100α percent commission Banker (player II) wins, where 0≤α≤1/10. Thus, now depends not just discrete d but also continuous α. Moreover, is no longer zero sum. To find all Nash equilibria B2, generalize algorithm bimatrix We that, with rare exceptions, equilibrium unique. obtain B3, based results, here unable prove uniqueness.